Realization of Probabilistic Automata: Categorial Approach
نویسندگان
چکیده
We present a categorical framework to study probabilistic automata starting by obtaining aggregation and interconnection as universal constructions. We also introduce the notion of probabilistic behavior in order to get adjunctions between probabilistic behavior and probabilistic automata. Thus we are able to extend to the probabilistic setting free and minimal realizations as universal constructions.
منابع مشابه
BL-general fuzzy automata and minimal realization: Based on the associated categories
The present paper is an attempt to study the minimal BL-general fuzzy automata which realizes the given fuzzy behavior. Of two methods applied for construction of such automaton presented here, one has been based on Myhill-Nerode's theory while the other has been based on derivatives of the given fuzzy behavior. Meanwhile, the categories of BL-general fuzzy automata and fuzzy behavior, along wi...
متن کاملAggregation and Interconnection of Hybrid Automata :
We start by introducing a notion of hybrid automata with a clear identiication of the signature component. Hybrid automata intermix discrete and continuous behavior, extending non-deterministic automata with attributes that evolve continuously with time according to evolution laws. Adopting a categorial approach to aggregating and interconnecting hybrid automata we look at a suitable deenition ...
متن کاملOn minimal realization of IF-languages: A categorical approach
he purpose of this work is to introduce and study the concept of minimal deterministic automaton with IF-outputs which realizes the given IF-language. Among two methods for construction of such automaton presented here, one is based on Myhill-Nerode's theory while the other is based on derivatives of the given IF-language. Meanwhile, the categories of deterministic automata with IF-outputs and ...
متن کاملAnytime Chart Realization with CCG
We describe an anytime chart realization algorithm for Combinatory Categorial Grammar (CCG) that essentially interleaves the packing and unpacking stages employed in previous hybrid symbolicstatistical approaches. With this algorithm, it becomes possible to use statistical language models both for improving the quality of the output text and for increasing the speed with which it is produced. I...
متن کاملReduction of BL-general L-fuzzy Automata
In this paper, we show that for any BL-general L-fuzzy automaton (BL-GLFA) there exists a complete deterministic accessible reduced BL-general L-fuzzy automaton that recognizing the behavior of the BL-GLFA. Also, we prove that for any finite realization β, there exists a minimal complete deterministic BL-GLFA recognizing β. We prove any complete deterministic accessible reduced BL-GLFA is a min...
متن کامل